منابع مشابه
Spectral Clustering on a Budget
Spectral clustering is a modern and wellknown method for performing data cluster-ing. However, it depends on the availabilityof a similarity matrix, which in many appli-cations can be non-trivial to obtain. In thispaper, we focus on the problem of perform-ing spectral clustering under a budget con-straint, where there is a limit on the numberof entries which can ...
متن کاملA Tutorial on Spectral Clustering
In recent years, spectral clustering has become one of the most popular modern clustering algorithms. It is simple to implement, can be solved efficiently by standard linear algebra software, and very often outperforms traditional clustering algorithms such as the k-means algorithm. On the first glance spectral clustering appears slightly mysterious, and it is not obvious to see why it works at...
متن کاملA Note On Spectral Clustering
Let G = (V,E) be an undirected graph, λk the kth smallest eigenvalue of the normalized Laplacian matrix LG of G, and ρ(k) (ρ̂(k)) the smallest value of the maximal conductance over all k disjoint subsets Z1, . . . , Zk (that form a partition) of V . Oveis Gharan and Trevisan [3] proved the existence of a k-way partition (P1, . . . , Pk) of V with ρ̂(k) 6 kρ(k). The k-way (approximate) partitionin...
متن کاملThe ensemble clustering with maximize diversity using evolutionary optimization algorithms
Data clustering is one of the main steps in data mining, which is responsible for exploring hidden patterns in non-tagged data. Due to the complexity of the problem and the weakness of the basic clustering methods, most studies today are guided by clustering ensemble methods. Diversity in primary results is one of the most important factors that can affect the quality of the final results. Also...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Knowledge Discovery from Data
سال: 2009
ISSN: 1556-4681,1556-472X
DOI: 10.1145/1631162.1631165